Many-to-One Boundary Labeling with Backbones
نویسندگان
چکیده
We study a boundary labeling problem, where multiple points may connect to the same label. In this new many-to-one model, a horizontal backbone reaches out of each label into the feature-enclosing rectangle. Feature points that need to be connected to this label are linked via vertical line segments to the backbone. We present dynamic programming algorithms for minimizing the total number of label occurrences and for minimizing the total leader length of crossing-free backbone labelings. When crossings are allowed, we aim at obtaining solutions with the minimum number of crossings. This can be achieved efficiently in the case of fixed label order; however, in the case of flexible label order we show that minimizing the number of leader crossings is NP-hard. Submitted: August 2014 Reviewed: May 2015 Revised: October 2015 Accepted: November 2015 Final: December 2015 Published: December 2015 Article type: Regular paper Communicated by: H. Meijer E-mail addresses: [email protected] (Michael A. Bekos) [email protected] (Sabine Cornelsen) [email protected] (Martin Fink) [email protected] (SeokHee Hong) [email protected] (Michael Kaufmann) [email protected] (Martin Nöllenburg) [email protected] (Ignaz Rutter) [email protected] (Antonios Symvo-
منابع مشابه
برچسب‌زنی نقش معنایی جملات فارسی با رویکرد یادگیری مبتنی بر حافظه
Abstract Extracting semantic roles is one of the major steps in representing text meaning. It refers to finding the semantic relations between a predicate and syntactic constituents in a sentence. In this paper we present a semantic role labeling system for Persian, using memory-based learning model and standard features. Our proposed system implements a two-phase architecture to first identify...
متن کاملMulti-stack Boundary Labeling Problems
The boundary labeling problem was recently introduced in [5] as a response to the problem of labeling dense point sets with large labels. In boundary labeling, we are given a rectangle R which encloses a set of n sites. Each site is associated with an axis-parallel rectangular label. The main task is to place the labels in distinct positions on the boundary of R, so that they do not overlap, an...
متن کاملLabeling of Human Serum Albumin with Stable Isotope of Bromine; an in Vitro Study
Background: Possibility to trace-label albumin with isotopes results in information concerning its synthesis, breakdown, and distribution in the intra and extra cellular spaces. The iodination of albumin is a widespread procedure used in scientific studies. Bromine not only is more reactive and less expensive than iodine, but bonds more easily with many elements. Therefore, it could be a suitab...
متن کاملA Statistical Study of two Diffusion Processes on Torus and Their Applications
Diffusion Processes such as Brownian motions and Ornstein-Uhlenbeck processes are the classes of stochastic processes that have been investigated by researchers in various disciplines including biological sciences. It is usually assumed that the outcomes of these processes are laid on the Euclidean spaces. However, some data in physical, chemical and biological phenomena indicate that they cann...
متن کاملEdge pair sum labeling of some cycle related graphs
Let G be a (p,q) graph. An injective map f : E(G) → {±1,±2,...,±q} is said to be an edge pair sum labeling if the induced vertex function f*: V (G) → Z - {0} defined by f*(v) = ΣP∈Ev f (e) is one-one where Ev denotes the set of edges in G that are incident with a vertex v and f*(V (G)) is either of the form {±k1,±k2,...,±kp/2} or {±k1,±k2,...,±k(p-1)/2} U {±k(p+1)/2} according as p is even or o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Graph Algorithms Appl.
دوره 19 شماره
صفحات -
تاریخ انتشار 2013